1,085 research outputs found
Infinite partition monoids
Let and be the partition monoid and symmetric
group on an infinite set . We show that may be generated by
together with two (but no fewer) additional partitions, and we
classify the pairs for which is
generated by . We also show that may be generated by the set of all idempotent partitions
together with two (but no fewer) additional partitions. In fact,
is generated by if and only if it is
generated by . We also
classify the pairs for which is
generated by . Among other results, we show
that any countable subset of is contained in a -generated
subsemigroup of , and that the length function on
is bounded with respect to any generating set
Variants of finite full transformation semigroups
The variant of a semigroup S with respect to an element a in S, denoted S^a,
is the semigroup with underlying set S and operation * defined by x*y=xay for
x,y in S. In this article, we study variants T_X^a of the full transformation
semigroup T_X on a finite set X. We explore the structure of T_X^a as well as
its subsemigroups Reg(T_X^a) (consisting of all regular elements) and E_X^a
(consisting of all products of idempotents), and the ideals of Reg(T_X^a).
Among other results, we calculate the rank and idempotent rank (if applicable)
of each semigroup, and (where possible) the number of (idempotent) generating
sets of the minimal possible size.Comment: 25 pages, 6 figures, 1 table - v2 includes a couple more references -
v3 changes according to referee comments (to appear in IJAC
- …